R2-equitability is satisfiable

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equitability Revisited: Why the ‘‘Equitable Threat Score’’ Is Not Equitable

In the forecasting of binary events, verification measures that are ‘‘equitable’’ were defined by Gandin and Murphy to satisfy two requirements: 1) they award all random forecasting systems, including those that always issue the same forecast, the same expected score (typically zero), and 2) they are expressible as the linear weighted sum of the elements of the contingency table, where the weig...

متن کامل

Graphs and Degree Equitability

Let be a graph. If  , G V E    is a function from the vertex set   V G to the set of positive integers. Then two vertices are   G , u v V   -equitable if     1 u v     . By the degree, equitable adjacency between vertices can be redefine almost all of the variants of the graphs. In this paper we study the degree equitability of the graph by defining equitable connectivity, equ...

متن کامل

Equitability and MIC: an FAQ

The original paper on equitability and the maximal information coefficient (MIC) [Reshef et al., 2011] has generated much discussion and interest, and so far MIC has enjoyed use in a variety of disciplines. This document serves to provide some basic background and understanding of MIC as well as to address some of the questions raised about MIC in the literature, and to provide pointers to rele...

متن کامل

Enumerating Satisfiable Propositional FormulCB

It is known experimentally that there is a threshold for satisfiability in 3-CNF formulre around the value 4.25 for the ratio of variables to clauses. It is also known that the threshold is sharp [Fri99], but that proof does not give a value for the threshold. We use purely combinatorial techniques to count the number of satisfiable boolean formulre given in conjunctive normal form. The intenti...

متن کامل

Generating Satisfiable Problem Instances

A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem generator and a complete search method to filter out the unsatisfiable instances. Unfortunately, this ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 2014

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.1403623111